package com.cat.dynamicPlanning;

/**
 * @author 曲大人的喵
 * @description https://leetcode.cn/problems/unique-paths-ii/description/
 * @create 2025/8/31 10:25
 * @since JDK17
 */

public class Solution31 {
    public int uniquePathsWithObstacles(int[][] g) {
        int m = g.length, n = g[0].length;
        int[][] dp = new int[m][n];
        dp[0][0] = 1;
        for (int i = 1; i < n; i++) {
            if (g[0][i] == 1) {
                dp[0][i] = 0;
            } else {
                dp[0][i] += dp[0][i - 1];
            }
        }
        for (int i = 1; i < m; i++) {
            if (g[i][0] == 1) {
                dp[i][0] = 0;
            } else {
                dp[i][0] += dp[i - 1][0];
            }
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                if (g[i][j] == 1) {
                    dp[i][j] = 0;
                } else {
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
                }
            }
        }

        return dp[m - 1][n - 1];
    }
}
